Data Sharing Model for Sequence Alignment to Reduce Database Retrieve

نویسندگان

  • Minjun Kim
  • Jai-Hoon Kim
  • Jin-Won Jung
  • Weontae Lee
چکیده

Many programs of bioinformatics provide biochemists and biologists retrieve and analysis services of gene and protein databases. These services access databases for each arrival of user's request, which takes a long time, increases server's overload and response time. In this paper, two data sharing models are presented to reduce database retrieve for sequence alignments. (1) Grouping model is proposed to share database access between many requests arrived in a certain period of time by utilizing database access patterns in bioinformatics. (2) Carpool model is also proposed to reduce response time as well as to increase system throughput by servicing new arriving request immediately together with the previous on going requests to share database accesses without waiting time. Simulation results show that two data sharing models can reduce the number of database access by sharing it among many requests and increase system throughput.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences

The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...

متن کامل

Segmenting Scenes by Matching Image Composites

In this paper, we investigate how, given an image, similar images sharing the same global description can help with unsupervised scene segmentation. In contrast to recent work in semantic alignment of scenes, we allow an input image to be explained by partial matches of similar scenes. This allows for a better explanation of the input scenes. We perform MRF-based segmentation that optimizes ove...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

Retrieval and on-the-fly alignment of sequence fragments from the HIV database

MOTIVATION The amount of HIV-1 sequence data generated (presently around 42000 sequences, of which more than 22000 are from the V3 region of the viral envelope) presents a challenge for anyone working on the analysis of these data. A major problem is obtaining the region of interest from the stored sequences, which often contain but are not limited to that region. In addition, multiple alignmen...

متن کامل

A Database Model for Medical Consultation

The database model presented in this paper is suitable for application in which queries may require non-crisp references to certain attributes. The data item (attribute) values may be crisp or fuzzy. For instance, such adjectives as 'high' or 'normal' may be attribute values for the attribute blood pressure. A disease or a condition can be described by a number of symptoms which may be crisp al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003